Imperfect information in Reactive Modules games
نویسندگان
چکیده
منابع مشابه
Imperfect Information in Reactive Modules Games
Reactive Modules is a high-level modelling language for concurrent, distributed, and multi-agent systems, which is used in a number of practical model checking tools. Reactive Modules Games are a game-theoretic extension of Reactive Modules, in which agents in a system are assumed to act strategically in an attempt to satisfy a temporal logic formula representing their individual goal. Reactive...
متن کاملGames with Imperfect Information
An information set in a game tree is a set of nodes from which the rules of the game require that the same alternative (i.e., move) be selected. Thus the nodes an information set are indistinguishable to the player moving from that set, thereby reflecting imperfect information, that is, information hidden from that player. Information sets arise naturally in (for example) card gaines like poker...
متن کاملLearning in concave games with imperfect information
This paper examines the convergence properties of a class of learning schemes for concave N -person games – that is, games with convex action spaces and individually concave payoff functions. Specifically, we focus on a family of learning methods where players adjust their actions by taking small steps along their individual payoff gradients and then “mirror” the output back to their feasible a...
متن کاملPure Strategies in Imperfect Information Stochastic Games
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, Büchi and coBüchi objectives, and investigate the existence of almost-sure/positively winning strategies for the first player when the second player is perfectly informed or more informed than the first player. We obtain decidability res...
متن کاملParanoia versus Overconfidence in Imperfect- Information Games
In minimax game-tree search, the min part of the minimax backup rule derives from what we will call the paranoid assumption: the assumption that the opponent will always choose a move that minimizes our payoff and maximizes his/her payoff (or our estimate of the payoff, if we cut off the search before reaching the end of the game). A potential criticism of this assumption is that the opponent m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2018
ISSN: 0890-5401
DOI: 10.1016/j.ic.2018.02.023